TSTP Solution File: NLP265^17 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : NLP265^17 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 09:41:02 EDT 2023

% Result   : Theorem 0.23s 0.60s
% Output   : Proof 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem    : NLP265^17 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.37  % Computer : n017.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Thu Aug 24 10:08:54 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.23/0.52  %----Proving TH0
% 0.23/0.52  %------------------------------------------------------------------------------
% 0.23/0.52  % File     : NLP265^17 : TPTP v8.1.2. Released v8.1.0.
% 0.23/0.52  % Domain   : Natural Language Processing
% 0.23/0.52  % Problem  : Schema instantiation example
% 0.23/0.52  % Version  : [BP13] axioms.
% 0.23/0.52  % English  : Alice intends Bob to believe that Portland is a big city.
% 0.23/0.52  
% 0.23/0.52  % Refs     : [BS96]  Bretier & Sadek (1996), Rational Agent as the Kernel o
% 0.23/0.52  %          : [RO12]  Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.23/0.52  %          : [BP13]  Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.23/0.52  %          : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.23/0.52  % Source   : [TPTP]
% 0.23/0.52  % Names    : MML014+1 [QMLTP]
% 0.23/0.52  
% 0.23/0.52  % Status   : ContradictoryAxioms 
% 0.23/0.52  % Rating   : 0.23 v8.1.0
% 0.23/0.52  % Syntax   : Number of formulae    :   39 (  12 unt;  18 typ;   8 def)
% 0.23/0.52  %            Number of atoms       :   70 (   8 equ;   0 cnn)
% 0.23/0.52  %            Maximal formula atoms :   12 (   3 avg)
% 0.23/0.52  %            Number of connectives :  136 (   1   ~;   1   |;   6   &; 121   @)
% 0.23/0.52  %                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
% 0.23/0.52  %            Maximal formula depth :   10 (   5 avg)
% 0.23/0.52  %            Number of types       :    4 (   2 usr)
% 0.23/0.52  %            Number of type conns  :   50 (  50   >;   0   *;   0   +;   0  <<)
% 0.23/0.52  %            Number of symbols     :   17 (  16 usr;   6 con; 0-3 aty)
% 0.23/0.52  %            Number of variables   :   39 (  21   ^;  17   !;   1   ?;  39   :)
% 0.23/0.52  % SPC      : TH0_CAX_EQU_NAR
% 0.23/0.52  
% 0.23/0.52  % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.23/0.52  %            version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.23/0.52  %            'modal' embedding, version 1.5.2. Logic specification used:
% 0.23/0.52  %            $modal == [$constants == $rigid,$quantification == $cumulative,
% 0.23/0.52  %            $modalities == $modal_system_S5].
% 0.23/0.52  %------------------------------------------------------------------------------
% 0.23/0.52  thf(mworld,type,
% 0.23/0.52      mworld: $tType ).
% 0.23/0.52  
% 0.23/0.52  thf(mindex,type,
% 0.23/0.52      mindex: $tType ).
% 0.23/0.52  
% 0.23/0.52  thf(mrel_type,type,
% 0.23/0.52      mrel: mindex > mworld > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf('#i_alice_type',type,
% 0.23/0.52      '#i_alice': mindex ).
% 0.23/0.52  
% 0.23/0.52  thf('#i_bob_type',type,
% 0.23/0.52      '#i_bob': mindex ).
% 0.23/0.52  
% 0.23/0.52  thf('#b_alice_type',type,
% 0.23/0.52      '#b_alice': mindex ).
% 0.23/0.52  
% 0.23/0.52  thf('#b_bob_type',type,
% 0.23/0.52      '#b_bob': mindex ).
% 0.23/0.52  
% 0.23/0.52  thf(mactual_type,type,
% 0.23/0.52      mactual: mworld ).
% 0.23/0.52  
% 0.23/0.52  thf(mlocal_type,type,
% 0.23/0.52      mlocal: ( mworld > $o ) > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mlocal_def,definition,
% 0.23/0.52      ( mlocal
% 0.23/0.52      = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mnot_type,type,
% 0.23/0.52      mnot: ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mand_type,type,
% 0.23/0.52      mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mor_type,type,
% 0.23/0.52      mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mimplies_type,type,
% 0.23/0.52      mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mequiv_type,type,
% 0.23/0.52      mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mnot_def,definition,
% 0.23/0.52      ( mnot
% 0.23/0.52      = ( ^ [A: mworld > $o,W: mworld] :
% 0.23/0.52            ~ ( A @ W ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mand_def,definition,
% 0.23/0.52      ( mand
% 0.23/0.52      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.23/0.52            ( ( A @ W )
% 0.23/0.52            & ( B @ W ) ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mor_def,definition,
% 0.23/0.52      ( mor
% 0.23/0.52      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.23/0.52            ( ( A @ W )
% 0.23/0.52            | ( B @ W ) ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mimplies_def,definition,
% 0.23/0.52      ( mimplies
% 0.23/0.52      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.23/0.52            ( ( A @ W )
% 0.23/0.52           => ( B @ W ) ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mequiv_def,definition,
% 0.23/0.52      ( mequiv
% 0.23/0.52      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.23/0.52            ( ( A @ W )
% 0.23/0.52          <=> ( B @ W ) ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mbox_type,type,
% 0.23/0.52      mbox: mindex > ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mbox_def,definition,
% 0.23/0.52      ( mbox
% 0.23/0.52      = ( ^ [R: mindex,Phi: mworld > $o,W: mworld] :
% 0.23/0.52          ! [V: mworld] :
% 0.23/0.52            ( ( mrel @ R @ W @ V )
% 0.23/0.52           => ( Phi @ V ) ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf(mdia_type,type,
% 0.23/0.52      mdia: mindex > ( mworld > $o ) > mworld > $o ).
% 0.23/0.52  
% 0.23/0.52  thf(mdia_def,definition,
% 0.23/0.52      ( mdia
% 0.23/0.52      = ( ^ [R: mindex,Phi: mworld > $o,W: mworld] :
% 0.23/0.52          ? [V: mworld] :
% 0.23/0.52            ( ( mrel @ R @ W @ V )
% 0.23/0.52            & ( Phi @ V ) ) ) ) ).
% 0.23/0.52  
% 0.23/0.52  thf('mrel_#i_alice_reflexive',axiom,
% 0.23/0.52      ! [W: mworld] : ( mrel @ '#i_alice' @ W @ W ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#i_alice_euclidean',axiom,
% 0.23/0.53      ! [W: mworld,V: mworld,U: mworld] :
% 0.23/0.53        ( ( ( mrel @ '#i_alice' @ W @ U )
% 0.23/0.53          & ( mrel @ '#i_alice' @ W @ V ) )
% 0.23/0.53       => ( mrel @ '#i_alice' @ U @ V ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#i_bob_reflexive',axiom,
% 0.23/0.53      ! [W: mworld] : ( mrel @ '#i_bob' @ W @ W ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#i_bob_euclidean',axiom,
% 0.23/0.53      ! [W: mworld,V: mworld,U: mworld] :
% 0.23/0.53        ( ( ( mrel @ '#i_bob' @ W @ U )
% 0.23/0.53          & ( mrel @ '#i_bob' @ W @ V ) )
% 0.23/0.53       => ( mrel @ '#i_bob' @ U @ V ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#b_alice_reflexive',axiom,
% 0.23/0.53      ! [W: mworld] : ( mrel @ '#b_alice' @ W @ W ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#b_alice_euclidean',axiom,
% 0.23/0.53      ! [W: mworld,V: mworld,U: mworld] :
% 0.23/0.53        ( ( ( mrel @ '#b_alice' @ W @ U )
% 0.23/0.53          & ( mrel @ '#b_alice' @ W @ V ) )
% 0.23/0.53       => ( mrel @ '#b_alice' @ U @ V ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#b_bob_reflexive',axiom,
% 0.23/0.53      ! [W: mworld] : ( mrel @ '#b_bob' @ W @ W ) ).
% 0.23/0.53  
% 0.23/0.53  thf('mrel_#b_bob_euclidean',axiom,
% 0.23/0.53      ! [W: mworld,V: mworld,U: mworld] :
% 0.23/0.53        ( ( ( mrel @ '#b_bob' @ W @ U )
% 0.23/0.53          & ( mrel @ '#b_bob' @ W @ V ) )
% 0.23/0.53       => ( mrel @ '#b_bob' @ U @ V ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf(portland_decl,type,
% 0.23/0.53      portland: $i ).
% 0.23/0.53  
% 0.23/0.53  thf(bigcity_decl,type,
% 0.23/0.53      bigcity: $i > mworld > $o ).
% 0.23/0.53  
% 0.23/0.53  thf(axiom_1_alice,axiom,
% 0.23/0.53      mlocal @ ( mbox @ '#b_alice' @ ( mimplies @ ( mand @ ( bigcity @ portland ) @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ) ) @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf(axiom_1_bob,axiom,
% 0.23/0.53      mlocal @ ( mbox @ '#b_bob' @ ( mimplies @ ( mand @ ( bigcity @ portland ) @ ( mbox @ '#b_bob' @ ( mbox @ '#b_alice' @ ( mnot @ ( bigcity @ portland ) ) ) ) ) @ ( mbox @ '#i_bob' @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) ) ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf(axiom_2,axiom,
% 0.23/0.53      mlocal @ ( mbox @ '#b_alice' @ ( bigcity @ portland ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf(axiom_3,axiom,
% 0.23/0.53      mlocal @ ( mbox @ '#b_alice' @ ( mbox @ '#b_bob' @ ( mnot @ ( bigcity @ portland ) ) ) ) ).
% 0.23/0.53  
% 0.23/0.53  thf(con,conjecture,
% 0.23/0.53      mlocal @ ( mbox @ '#i_alice' @ ( mbox @ '#b_bob' @ ( bigcity @ portland ) ) ) ).
% 0.23/0.53  
% 0.23/0.53  %------------------------------------------------------------------------------
% 0.23/0.53  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.aet3UIfn5c/cvc5---1.0.5_17137.p...
% 0.23/0.53  (declare-sort $$unsorted 0)
% 0.23/0.53  (declare-sort tptp.mworld 0)
% 0.23/0.53  (declare-sort tptp.mindex 0)
% 0.23/0.53  (declare-fun tptp.mrel (tptp.mindex tptp.mworld tptp.mworld) Bool)
% 0.23/0.53  (declare-fun |tptp.'#i_alice'| () tptp.mindex)
% 0.23/0.53  (declare-fun |tptp.'#i_bob'| () tptp.mindex)
% 0.23/0.53  (declare-fun |tptp.'#b_alice'| () tptp.mindex)
% 0.23/0.53  (declare-fun |tptp.'#b_bob'| () tptp.mindex)
% 0.23/0.53  (declare-fun tptp.mactual () tptp.mworld)
% 0.23/0.53  (declare-fun tptp.mlocal ((-> tptp.mworld Bool)) Bool)
% 0.23/0.53  (assert (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))
% 0.23/0.53  (declare-fun tptp.mnot ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (declare-fun tptp.mand ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (declare-fun tptp.mor ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (declare-fun tptp.mimplies ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (declare-fun tptp.mequiv ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (assert (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))
% 0.23/0.53  (assert (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))
% 0.23/0.53  (assert (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))
% 0.23/0.53  (assert (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))
% 0.23/0.53  (assert (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))
% 0.23/0.53  (declare-fun tptp.mbox (tptp.mindex (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (assert (= tptp.mbox (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))
% 0.23/0.53  (declare-fun tptp.mdia (tptp.mindex (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.23/0.53  (assert (= tptp.mdia (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))
% 0.23/0.60  (assert (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) W) W)))
% 0.23/0.60  (assert (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#i_alice'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))))
% 0.23/0.60  (assert (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_bob'|) W) W)))
% 0.23/0.60  (assert (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#i_bob'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))))
% 0.23/0.60  (assert (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) W) W)))
% 0.23/0.60  (assert (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#b_alice'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))))
% 0.23/0.60  (assert (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) W) W)))
% 0.23/0.60  (assert (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#b_bob'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))))
% 0.23/0.60  (declare-fun tptp.portland () $$unsorted)
% 0.23/0.60  (declare-fun tptp.bigcity ($$unsorted tptp.mworld) Bool)
% 0.23/0.60  (assert (let ((_let_1 (@ tptp.bigcity tptp.portland))) (let ((_let_2 (@ tptp.mbox |tptp.'#b_bob'|))) (let ((_let_3 (@ tptp.mbox |tptp.'#b_alice'|))) (@ tptp.mlocal (@ _let_3 (@ (@ tptp.mimplies (@ (@ tptp.mand _let_1) (@ _let_3 (@ _let_2 (@ tptp.mnot _let_1))))) (@ (@ tptp.mbox |tptp.'#i_alice'|) (@ _let_2 _let_1)))))))))
% 0.23/0.60  (assert (let ((_let_1 (@ tptp.bigcity tptp.portland))) (let ((_let_2 (@ tptp.mbox |tptp.'#b_alice'|))) (let ((_let_3 (@ tptp.mbox |tptp.'#b_bob'|))) (@ tptp.mlocal (@ _let_3 (@ (@ tptp.mimplies (@ (@ tptp.mand _let_1) (@ _let_3 (@ _let_2 (@ tptp.mnot _let_1))))) (@ (@ tptp.mbox |tptp.'#i_bob'|) (@ _let_2 _let_1)))))))))
% 0.23/0.60  (assert (@ tptp.mlocal (@ (@ tptp.mbox |tptp.'#b_alice'|) (@ tptp.bigcity tptp.portland))))
% 0.23/0.60  (assert (@ tptp.mlocal (@ (@ tptp.mbox |tptp.'#b_alice'|) (@ (@ tptp.mbox |tptp.'#b_bob'|) (@ tptp.mnot (@ tptp.bigcity tptp.portland))))))
% 0.23/0.60  (assert (not (@ tptp.mlocal (@ (@ tptp.mbox |tptp.'#i_alice'|) (@ (@ tptp.mbox |tptp.'#b_bob'|) (@ tptp.bigcity tptp.portland))))))
% 0.23/0.60  (set-info :filename cvc5---1.0.5_17137)
% 0.23/0.60  (check-sat-assuming ( true ))
% 0.23/0.60  ------- get file name : TPTP file name is NLP265^17
% 0.23/0.60  ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_17137.smt2...
% 0.23/0.60  --- Run --ho-elim --full-saturate-quant at 10...
% 0.23/0.60  % SZS status Theorem for NLP265^17
% 0.23/0.60  % SZS output start Proof for NLP265^17
% 0.23/0.60  (
% 0.23/0.60  (let ((_let_1 (@ tptp.bigcity tptp.portland))) (let ((_let_2 (@ tptp.mbox |tptp.'#b_bob'|))) (let ((_let_3 (@ (@ tptp.mbox |tptp.'#i_alice'|) (@ _let_2 _let_1)))) (let ((_let_4 (not (@ tptp.mlocal _let_3)))) (let ((_let_5 (@ tptp.mnot _let_1))) (let ((_let_6 (@ tptp.mbox |tptp.'#b_alice'|))) (let ((_let_7 (@ _let_6 (@ _let_2 _let_5)))) (let ((_let_8 (@ tptp.mlocal _let_7))) (let ((_let_9 (@ _let_6 _let_1))) (let ((_let_10 (@ tptp.mlocal _let_9))) (let ((_let_11 (@ tptp.mand _let_1))) (let ((_let_12 (@ tptp.mlocal (@ _let_6 (@ (@ tptp.mimplies (@ _let_11 _let_7)) _let_3))))) (let ((_let_13 (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) W) W)))) (let ((_let_14 (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) W) W)))) (let ((_let_15 (= tptp.mdia (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))) (let ((_let_16 (= tptp.mbox (lambda ((R tptp.mindex) (Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ (@ tptp.mrel R) W) V) (@ Phi V))))))) (let ((_let_17 (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))) (let ((_let_18 (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))) (let ((_let_19 (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))) (let ((_let_20 (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))) (let ((_let_21 (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))) (let ((_let_22 (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))) (let ((_let_23 (ho_3 k_2 |tptp.'#b_alice'|))) (let ((_let_24 (ho_4 _let_23 tptp.mactual))) (let ((_let_25 (ho_5 _let_24 tptp.mactual))) (let ((_let_26 (ho_5 (ho_7 k_6 tptp.portland) tptp.mactual))) (let ((_let_27 (not _let_26))) (let ((_let_28 (not _let_25))) (let ((_let_29 (or _let_28 _let_27))) (let ((_let_30 (forall ((W tptp.mworld)) (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) W) W)))) (let ((_let_31 (EQ_RESOLVE (ASSUME :args (_let_13)) (PREPROCESS :args ((= _let_13 _let_30)))))) (let ((_let_32 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (tptp.mactual QUANTIFIERS_INST_E_MATCHING_SIMPLE ((ho_4 _let_23 W)))) :args (_let_30))) _let_31 :args (_let_25 false _let_30)))) (let ((_let_33 (forall ((V tptp.mworld)) (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) tptp.mactual) V)) (not (ho_5 (ho_7 k_6 tptp.portland) V)))))) (let ((_let_34 (forall ((BOUND_VARIABLE_957 tptp.mworld)) (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_bob'|) BOUND_VARIABLE_957) BOUND_VARIABLE_957)) (ho_5 (ho_7 k_6 tptp.portland) BOUND_VARIABLE_957))))) (let ((_let_35 (forall ((BOUND_VARIABLE_896 tptp.mworld)) (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_bob'|) BOUND_VARIABLE_896) BOUND_VARIABLE_896)) (not (ho_5 (ho_7 k_6 tptp.portland) BOUND_VARIABLE_896)))))) (let ((_let_36 (not _let_35))) (let ((_let_37 (and _let_36 (not (forall ((BOUND_VARIABLE_1013 tptp.mworld)) (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) BOUND_VARIABLE_1013) BOUND_VARIABLE_1013))))))) (let ((_let_38 (forall ((BOUND_VARIABLE_1022 tptp.mworld)) (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#i_alice'|) BOUND_VARIABLE_1022) BOUND_VARIABLE_1022))))) (let ((_let_39 (forall ((BOUND_VARIABLE_957 tptp.mworld)) (or (not (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) BOUND_VARIABLE_957) BOUND_VARIABLE_957)) (@ (@ tptp.bigcity tptp.portland) BOUND_VARIABLE_957))))) (let ((_let_40 (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_15)) (MACRO_SR_EQ_INTRO :args (_let_15 SB_DEFAULT SBA_FIXPOINT))) (EQ_RESOLVE (ASSUME :args (_let_16)) (MACRO_SR_EQ_INTRO :args (_let_16 SB_DEFAULT SBA_FIXPOINT))) (ASSUME :args (_let_17)) (ASSUME :args (_let_18)) (ASSUME :args (_let_19)) (ASSUME :args (_let_20)) (ASSUME :args (_let_21)) (ASSUME :args (_let_22))))) (let ((_let_41 (not _let_37))) (let ((_let_42 (forall ((V tptp.mworld)) (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) tptp.mactual) V))))) (let ((_let_43 (_let_42))) (let ((_let_44 (tptp.mactual QUANTIFIERS_INST_CBQI_CONFLICT))) (let ((_let_45 (forall ((BOUND_VARIABLE_896 tptp.mworld)) (or (not (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) BOUND_VARIABLE_896) BOUND_VARIABLE_896)) (not (@ (@ tptp.bigcity tptp.portland) BOUND_VARIABLE_896)))))) (let ((_let_46 (ho_3 k_2 |tptp.'#i_alice'|))) (let ((_let_47 (ho_5 (ho_4 _let_46 tptp.mactual) tptp.mactual))) (let ((_let_48 (forall ((W tptp.mworld)) (ho_5 (ho_4 (ho_3 k_2 |tptp.'#i_alice'|) W) W)))) (let ((_let_49 (EQ_RESOLVE (ASSUME :args (_let_14)) (PREPROCESS :args ((= _let_14 _let_48)))))) (let ((_let_50 (_let_38))) (let ((_let_51 (_let_33))) (let ((_let_52 (tptp.mactual QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (ho_5 _let_24 V) false)))))) (let ((_let_53 (or _let_28 _let_26))) (let ((_let_54 (forall ((V tptp.mworld)) (or (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#b_alice'|) tptp.mactual) V)) (ho_5 (ho_7 k_6 tptp.portland) V))))) (let ((_let_55 (EQ_RESOLVE (ASSUME :args (_let_10)) (TRANS (MACRO_SR_EQ_INTRO _let_40 :args (_let_10 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((V tptp.mworld)) (or (not (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) tptp.mactual) V)) (@ (@ tptp.bigcity tptp.portland) V))) _let_54))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_29)) :args ((or _let_28 _let_27 (not _let_29)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_53)) :args ((or _let_28 _let_26 (not _let_53)))) _let_32 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_55 :args _let_52) :args (_let_54))) _let_55 :args (_let_53 false _let_54)) :args (_let_26 false _let_25 false _let_53)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_51) :args _let_52) :args _let_51)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (ASSUME :args (_let_12)) (TRANS (MACRO_SR_EQ_INTRO _let_40 :args (_let_12 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (or _let_39 (and (not _let_45) (not (forall ((BOUND_VARIABLE_1013 tptp.mworld)) (not (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) BOUND_VARIABLE_1013) BOUND_VARIABLE_1013))))) (forall ((BOUND_VARIABLE_1022 tptp.mworld)) (not (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) BOUND_VARIABLE_1022) BOUND_VARIABLE_1022))) (forall ((V tptp.mworld)) (or (not (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) tptp.mactual) V)) (not (@ (@ tptp.bigcity tptp.portland) V))))) (or _let_34 _let_37 _let_38 _let_33)))))) :args ((or _let_33 _let_38 _let_37 _let_34))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_50) :args _let_44) :args _let_50)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_49 :args (tptp.mactual QUANTIFIERS_INST_E_MATCHING_SIMPLE ((ho_4 _let_46 W)))) :args (_let_48))) _let_49 :args (_let_47 false _let_48)) :args ((not _let_38) false _let_47)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_37 0)) :args ((or _let_36 _let_41))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_8)) (TRANS (MACRO_SR_EQ_INTRO _let_40 :args (_let_8 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (or _let_45 (forall ((V tptp.mworld)) (not (@ (@ (@ tptp.mrel |tptp.'#b_alice'|) tptp.mactual) V)))) (or _let_35 _let_42)))))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_43) :args _let_44) :args _let_43)) _let_32 :args ((not _let_42) false _let_25)) :args (_let_35 true _let_42)) :args (_let_41 false _let_35)) (NOT_OR_ELIM (EQ_RESOLVE (ASSUME :args (_let_4)) (TRANS (MACRO_SR_EQ_INTRO _let_40 :args (_let_4 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (or _let_39 (forall ((V tptp.mworld)) (not (@ (@ (@ tptp.mrel |tptp.'#i_alice'|) tptp.mactual) V))))) (not (or _let_34 (forall ((V tptp.mworld)) (not (ho_5 (ho_4 (ho_3 k_2 |tptp.'#i_alice'|) tptp.mactual) V)))))))))) :args (0)) :args (_let_33 true _let_38 true _let_37 true _let_34)) :args (_let_29 false _let_33)) _let_32 :args (false false _let_26 false _let_29 false _let_25)) :args (_let_22 _let_21 _let_20 _let_19 _let_18 _let_17 _let_16 _let_15 _let_14 (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#i_alice'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))) (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#i_bob'|) W) W)) (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#i_bob'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))) _let_13 (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#b_alice'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))) (forall ((W tptp.mworld)) (@ (@ (@ tptp.mrel |tptp.'#b_bob'|) W) W)) (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel |tptp.'#b_bob'|))) (let ((_let_2 (@ _let_1 W))) (=> (and (@ _let_2 U) (@ _let_2 V)) (@ (@ _let_1 U) V))))) _let_12 (@ tptp.mlocal (@ _let_2 (@ (@ tptp.mimplies (@ _let_11 (@ _let_2 (@ _let_6 _let_5)))) (@ (@ tptp.mbox |tptp.'#i_bob'|) _let_9)))) _let_10 _let_8 _let_4 true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.23/0.61  )
% 0.23/0.61  % SZS output end Proof for NLP265^17
% 0.23/0.61  % cvc5---1.0.5 exiting
% 0.23/0.61  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------